NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
201	Reconfiguring Independent Sets in Claw-Free Graphs∗ Paul Bonsma† Marcin Kami´ nski‡ Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2015-07-28 10:23:00 NP-complete problems Graph operations Graph coloring Line graph Dominating set Claw-free graph Chordal graph Graph Neighbourhood Independent set Matching Median graph
202	CS264: Homework #7 Due by midnight on Wednesday, November 12, 2014 Instructions: (1) Students taking the course pass-fail should complete the exercises. Students taking the course for a letter grade should complete both Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-06 11:24:24 NP-complete problems Combinatorial optimization Maximum cut Knapsack problem
203	June 23, :19 WSPC - Proceedings Trim Size: 9in x 6in Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:57:08 Graph coloring NP-complete problems Graph theory Matching Color-coding Graph Chromatic polynomial Tree-depth
204	Maximum Motif Problem in Vertex-Colored Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1 Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2011-04-27 05:28:57 NP-complete problems Graph coloring Graph connectivity Combinatorial optimization Matching Vertex cover Bridge Color-coding Treewidth Neighbourhood Covering graph Incidence coloring
205	Monochromatic triangles in two-colored plane V´ıt Jel´ınek Jan Kynˇcl Rudolf Stolaˇr ´ s Valla Tomaˇ Add to Reading List Source URL: kam.mff.cuni.cz Language: English - Date: 2007-02-02 08:52:54 Graph coloring NP-complete problems Monochromatic triangle E2
206	An Approximation Algorithm for Bounded Degree Deletion∗ Tom´aˇs Ebenlendr† Petr Kolman‡ Add to Reading List Source URL: kam.mff.cuni.cz Language: English - Date: 2009-06-04 05:35:50 NP-complete problems Functional analysis Vertex cover Distribution Graph coloring Dominating set Maximal independent set
207	A semidefinite programming hierarchy for packing problems in discrete geometry David de Laat (TU Delft) Joint work with Frank Vallentin (Universit¨at zu K¨oln) Applications of Real Algebraic Geometry Add to Reading List Source URL: www.daviddelaat.nl Language: English NP-complete problems Operations research Independent set Optimization problem Discrete geometry Graph Duality Packing problems Mathematical optimization Planar graphs Matching Matroid
208	Smoothed Complexity Theory Markus Bl¨aser1 and Bodo Manthey2 1 Saarland University, 2 Add to Reading List Source URL: www-cc.cs.uni-saarland.de Language: English - Date: 2014-01-17 04:45:53 Complexity classes Computational complexity theory Mathematical optimization Analysis of algorithms NP-complete problems Smoothed analysis IP PP NP Time complexity Average-case complexity Boolean satisfiability problem
209	Theoretical Computer Science–2863 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Add to Reading List Source URL: www.cs.huji.ac.il Language: English - Date: 2014-11-26 08:32:25 Computational complexity theory Approximation algorithms Complexity classes Operations research NP-complete problems Polynomial-time approximation scheme Travelling salesman problem Steiner tree problem APX Optimization problem Combinatorial optimization NP

UPDATE